Round - Robin Queueing System with Tow Input - Sources
نویسنده
چکیده
This paper investigates the reund-robin queueing system with two distinet inputsources. Two types of jobs arrive at the system in Poisson laws with parameters it and R2, respectively. Jobs' service times are subject to the exponential distributions with different means characterized th3 two types of jobs. With the round-robin discipline, the service facility pro:esses each type of job for a maximum q seconds; if the job's ervice is completed during this quantum, it leaves the system, othrwise it returns to the end of a queue to wait another quantum of service, The analysis focuses on the mean queue length of each type of job by leading the generating function for the equilibrium queue Iength probabilities,
منابع مشابه
Stability Improvement of Hydraulic Turbine Regulating System Using Round-Robin Scheduling Algorithm
The sustainability of hydraulic turbines was one of the most important issues considered by electrical energy provider experts. Increased electromechanical oscillation damping is one of the key issues in the turbines sustainability. Electromechanical oscillations, if not quickly damp, can threaten the stability of hydraulic turbines and causes the separation of different parts of the netw...
متن کاملSimulation Study of Weighted Round-Robin Queueing Policy
In modern networks serving real systems, there are a wide of variety of classes of messages. This results in the need for more sophisticated queueing policies. The desired queueing disciplines are expected to be able to consider all variables which are needed to handle messages appropriately. These variables include: diierent required service times, source traac chacteristics and quality of ser...
متن کاملRouting on Input Queued Buffered Sparse-Crossbar Packet Concentrators
In this paper we characterize the features of good packet routing schemes for input queued sparse crossbar based packet concentrators and propose a polling based routing algorithm which achieves near optimal performance. It has been shown by the authors of this paper that the performance of an input queued packet concentrator with different input and output packet rates can be modeled by a GI/D...
متن کاملDelay Analysis of Fair Queueing Algorithms with theStochastic Comparison Approach
The delay characteristics of leaky-bucket constrained sources under Fair Queueing (FQ) policies are evaluated through the worst-case delay bounds. Clearly, these deterministic bounds do not always provide an insight into the underlying system. Moreover, with general stochas-tic source models, there is no analytical method to analyze the delay characteristics. We propose to apply the stochastic ...
متن کاملA simple and effective scheduling mechanism using minimized cycle round robin
packet and cell switched networks. We demonstrate that MCRR exhibits optimal worst-case latency property in a certain class of weighted round robin (WRR) approaches which are currently used for packet (cell) scheduling in high-speed networks, such as ATM networks. We further present a Hierarchical MCRR (HMCRR) mechanism to maximize the efficacy of MCRR in practice and be scalable to large numbe...
متن کامل